• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    The service switching point counts the number of pending queries sent to the service control point waiting for a response. When the count reaches the threshold, it rejects further calls. This prevents the load on the service control point from becoming excessive.
    公开号:KR20000067863A
    申请号:KR1019997000223
    申请日:1997-07-16
    公开日:2000-11-25
    发明作者:젤레마바트；피렌렌；크로우간루이스；아벤후리크
    申请人:에를링 블로메, 타게 뢰브그렌；텔레폰아크티에볼라게트 엘엠 에릭슨；
    IPC主号:
    专利说明:

    Dynamic Load Limiting Mechanism {DYNAMIC LOAD LIMITING}
    Specifically, an embodiment of the present invention includes a Service Control Point in an Intelligent Network configuration, which typically has a large number of Service Switching Points (SSPs) connected to it. It is. Each SSP is a switching system that intercepts telephone calls and also queries SCP. The SCP contains service specific logic and data, which allows the SCP to send an indication to the SSP on how to handle intercepted calls.
    Obviously, if the SCP receives an excessive number of si-multaneous queries from different SSPs, confusion may occur within the signaling links of the network and may exceed the throughput of the SCP. As such, this may result in an unacceptable delay in processing the calls.
    For the existing intelligent network specification, page 136-139 of ETS 300 374-1 defines call gapping as the only means of reducing the amount of signal to SCPs.
    When a SCP detects a high load condition, it instructs some or all of the SSPs to initiate a call gapping, which means that the speed of contact to the allowed SCP is reduced. However, due to the high load detection by the SCP and the delay until the call gapping is initiated by the SSP, this mechanism is somewhat inefficient. As a result, an unexpected peak in the number of SCP doors still causes the SCP to overload.
    The present invention relates to a mechanism for limiting the load on a central point in a network architecture.
    In order to help the understanding of the present invention, the following reference numerals are attached to the accompanying drawings,
    1 is a schematic block diagram of a network configuration for carrying out the invention,
    2 is a flowchart showing a part of the operation in the SSP according to the present invention.
    According to the present invention, the SSP is equipped with a dynamic mechanism for monitoring the load state of the SCP to prevent the overload. This is done by defining an upper limit on the number of SCP queries waiting for a response and also rejecting any number of call attempts that exceed that limit.
    This has the advantage that the SSP can automatically react to changes in the load state of the SCP, allowing for faster response to flooding on unexpected calls without the need for any message from the SCP.
    The network configuration shown in FIG. 1 includes a service control point (SCP) 2, to which a plurality of service switching points (SSPs) 4, 6, 8 and 10 are connected. In the intelligent network configuration, the SSP intercepts telephone calls and also queries the SCP. The SCP instructs the SSP on how to handle the intercepted call.
    2 is a flowchart showing how the SSP operates the load limiting mechanism according to the present invention. Within an SSP, coefficient values may be assigned to a given set of calling standards, such as a specific number of calls. Each counter has a predetermined maximum value, that is, an upper limit.
    In step 22 of the process shown in FIG. 2, a call attempt matching one of the standards is received at the SSP. At step 24, the corresponding count value is incremented. The staff 26 determines whether the count value reaches a fixed maximum value. If not yet, the inquiry is sent to the SCP at staff 28. As the response from the SCP to the inquiry is received via the staff 36, the staff 38 increments its corresponding count value.
    A success count value representing the number of consecutive inquiries that have received a successful response is incremented in step 40. Next, the staff 42 determines whether the success factor value reaches a certain number. If so, the step 44 automatically raises the maximum count value as defined above by a predetermined increment. The process then returns to the starting position.
    If it is not determined at step 26 whether the count value has reached a predetermined maximum value, it indicates that the SCP is in a high load state, which increases the response time to the inquiry. In order to solve this problem, the staff 30 reduces the maximum count value as determined above through a predetermined deceleration step. The staff 32 then rejects the received call and does not allow any further calls. The success factor value is also reset to zero through the step 33. In this state, as indicated by staff 34, the count value is monitored until the value reaches a lower value that is a few percent or less of the current maximum count value. When the low reaches, ie when the answer at step 34 is YES, the SSP is able to respond to call attempts again, so that the process returns to the starting position.
    This mechanism may be permanently fixed, or may be activated manually by the SSP or by instructions sent from the SCP to the SSP. Moreover, the initial maximum value setting as the count value can be set in a similar manner manually in the SSP or through an instruction from the SCP.
    That is, a mechanism for automatically controlling the load applied to the SCP without having to receive a message from the SCP is obtained. Due to the fact that the maximum value as the counting means is always present, it is possible to handle the flooding at any time in a sudden call.
    In the above, the present invention has been described using an example of an intelligent network communication configuration in which the SSP has a mechanism for restricting the inquiry to the SCP. Any network configuration you require can use a similar mechanism.
    As such, the present invention provides a dynamic load limiting mechanism capable of quickly responding to the SSP itself in response to an unexpected call flood, thereby greatly improving the quality of service in a related communication field.
    权利要求:
    Claims (10)
    [1" claim-type="Currently amended] In a switching point for a network configuration having a central control point and a plurality of switching points connected thereto,
    Send an inquiry to the control point to receive a response from it;
    Counting the number of pending inquiries sent to the control point and waiting for a response;
    And when the number of pending queries reaches a threshold, preventing further inquiries from being sent to the control point.
    [2" claim-type="Currently amended] The switching point of claim 1, wherein the threshold decreases when the number of pending queries reaches the threshold.
    [3" claim-type="Currently amended] The switching point of claim 1 or 2, wherein the threshold increases when a certain number of consecutive inquiries are successfully answered.
    [4" claim-type="Currently amended] The switching point of claim 1, wherein the number of pending queries of different categories is counted.
    [5" claim-type="Currently amended] 12. A method of processing an in-switch telephone call that forms part of a network configuration having a central control point and multiple switching points connected thereto for handling queries from the switching points,
    Accepting the call attempt;
    Incrementing a coefficient value that decreases each time a response is received from the control point for one query;
    Comparing the count value with a predetermined threshold value;
    Sending a query to the control point if the count value is less than the threshold value, and rejecting the call attempt if the count value is greater than the threshold value.
    [6" claim-type="Currently amended] 6. The method of claim 5 including determining whether a call attempt matches one of certain standards, and if there is a match, incrementing the associated coefficient value.
    [7" claim-type="Currently amended] 7. The method of claim 6, wherein each coefficient value associated with each of the predetermined standards has a predetermined threshold value.
    [8" claim-type="Currently amended] In a network configuration comprising a central control point and a plurality of switching points connected thereto to send inquiries to and receive responses from the control points, each switching point counts the number of pending inquiries sent to the control point and waiting for a response. And when the number of pending queries reaches a threshold value, prevents further inquiry from being sent.
    [9" claim-type="Currently amended] 9. The network configuration of claim 8, wherein the threshold value decreases when the count value reaches the threshold value.
    [10" claim-type="Currently amended] 10. The network configuration of claim 8 or 9, wherein the threshold increases when a certain number of consecutive inquiries are successfully answered.
    类似技术:
    公开号 | 公开日 | 专利标题
    JP3616134B2|2005-02-02|Call processing method and system in communication network
    US5533106A|1996-07-02|Method and system for processing calls wherein the display of calling party ID information has been inhibited
    US6252950B1|2001-06-26|Predictive bursty real-time traffic control for telecommunications switching systems
    US5394463A|1995-02-28|Telephone call processing arrangement based on calling and called party telephone services
    US4009342A|1977-02-22|Circuit arrangement for communication facilities wherein transmission paths can be employed for different types of message switching
    CA1310731C|1992-11-24|Exchange system having originating call restriction function
    US6501831B2|2002-12-31|Method of providing 911 service to a private branch exchange
    CA2220898C|2000-12-26|Systems and methods for providing communications through an alternate communication network
    US4873719A|1989-10-10|Enhanced calling number delivery service system
    CA2173167C|1999-09-28|Intelligent call forwarding
    US4400587A|1983-08-23|Overflow and diversion to a foreign switch
    US5844896A|1998-12-01|System and method for routing telephone calls
    US7130397B2|2006-10-31|Apparatus, and an associated method, for detecting a mass call event and for ameliorating the effects thereof
    US5295183A|1994-03-15|Congestion control system for telecommunications
    US5963629A|1999-10-05|Method for embodying automatic call in a keyphone system
    US5475737A|1995-12-12|Toll saver for centralized messaging systems
    US5570420A|1996-10-29|Customer premise equipment network integrator
    FI97185B|1996-07-15|Congestion prevention at a telecommunication network node
    US5548533A|1996-08-20|Overload control for a central processor in the switching network of a mobile communications system
    US6327361B1|2001-12-04|Multivariate rate-based overload control for multiple-class communications traffic
    KR20030069855A|2003-08-27|Mobile station, and apparatus, system and method for management of emergency calls
    US5488609A|1996-01-30|Dynamic rate adjustment for overload control in communication networks
    US6243449B1|2001-06-05|Mass calling event detection and control
    US6310946B1|2001-10-30|Method for interrupting a telephone call after receiving a busy signal
    US5898672A|1999-04-27|Overload prevention in a telecommunication network node
    同族专利:
    公开号 | 公开日
    AU720630B2|2000-06-08|
    CN1536899A|2004-10-13|
    GB9615149D0|1996-09-04|
    EP0913045A2|1999-05-06|
    EP0913045B1|2005-04-06|
    DE69732967T2|2006-04-27|
    US6707900B1|2004-03-16|
    WO1998004078A2|1998-01-29|
    MY125755A|2006-08-30|
    WO1998004078A3|1998-05-07|
    JP4391591B2|2009-12-24|
    BR9710491B1|2009-05-05|
    CA2260821A1|1998-01-29|
    JP2000515695A|2000-11-21|
    GB2315635A|1998-02-04|
    AU4201397A|1998-02-10|
    GB2315635B|2000-10-11|
    CN1242601C|2006-02-15|
    CN1536899B|2010-12-29|
    DE69732967D1|2005-05-12|
    ES2236825T3|2005-07-16|
    DK0913045T3|2005-08-01|
    BR9710491A|1999-08-17|
    CN1225216A|1999-08-04|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    法律状态:
    1996-07-19|Priority to GB9615149.3
    1996-07-19|Priority to GB9615149A
    1997-07-16|Application filed by 에를링 블로메, 타게 뢰브그렌, 텔레폰아크티에볼라게트 엘엠 에릭슨
    2000-11-25|Publication of KR20000067863A
    优先权:
    申请号 | 申请日 | 专利标题
    GB9615149.3|1996-07-19|
    GB9615149A|GB2315635B|1996-07-19|1996-07-19|Dynamic load limiting|
    [返回顶部]